CLUSTAG: hierarchical clustering and graph methods for selecting tag SNPs
نویسندگان
چکیده
منابع مشابه
CLUSTAG: hierarchical clustering and graph methods for selecting tag SNPs
UNLABELLED Cluster and set-cover algorithms are developed to obtain a set of tag single nucleotide polymorphisms (SNPs) that can represent all the known SNPs in a chromosomal region, subject to the constraint that all SNPs must have a squared correlation R2>C with at least one tag SNP, where C is specified by the user. AVAILABILITY http://hkumath.hku.hk/web/link/CLUSTAG/CLUSTAG.html CONTACT...
متن کاملGraph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members
Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...
متن کاملHierarchical clustering for graph visualization
This paper describes a graph visualization methodology based on hierarchical maximal modularity clustering, with interactive and significant coarsening and refining possibilities. An application of this method to HIV epidemic analysis in Cuba is outlined.
متن کاملA Resource-tag Attribute Graph Clustering Algorithm
In order to improve the effectiveness of clustering, a resource-tag attribute graph clustering algorithm is proposed in this paper, which makes a two-stage of clustering by the use of attribute tags of nodes in graphs. Firstly tags clusters are generated based on the weight and similarity of tags, which is the preprocessing of tags. Secondly the attribute vectors of nodes in resources are teste...
متن کاملBayesian Methods for Graph Clustering
Networks are used in many scientific fields such as biology, social science, and information technology. They aim at modelling, with edges, the way objects of interest, represented by vertices, are related to each other. Looking for clusters of vertices, also called communities or modules, has appeared to be a powerful approach for capturing the underlying structure of a network. In this contex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2004
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/bti201